Search results for "Sequential game"
showing 10 items of 19 documents
A Sequential Game Approach for Computation-Offloading in an UAV Network
2017
International audience; Small drones are currently emerging as versatile nascent technology that can be used in exploration and surveillance missions. However, most of the underlying applications require very often complex and time-consuming calculations. Although, the limited resources available onboard the small drones, their mobility, the computation delays and energy consumption make the operation of these applications very challenging. Nevertheless, computation-offloading solutions provide feasible resolves to mitigate the issues facing these constrained devices. In this context, we address in this paper the problem of offloading highly intensive computation tasks, performed by a fleet…
Strategic Thinking under social influence: Scalability, stability and robustness of allocations
2016
This paper studies the strategic behavior of a large number of game designers and studies the scalability, stability and robustness of their allocations in a large number of homogeneous coalitional games with transferable utilities (TU). For each TU game, the characteristic function is a continuous-time stochastic process. In each game, a game designer allocates revenues based on the extra reward that a coalition has received up to the current time and the extra reward that the same coalition has received in the other games. The approach is based on the theory of mean-field games with heterogeneous groups in a multi-population regime.
Robust Allocation Rules in Dynamical Cooperative TU Games
2011
Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.
On Capturing Rent from a Non-Renewable Resource International Monopoly: A Dynamic Game Approach
2005
In this paper we model the case of an international non-renewable resource monopolist as a dynamic game between a monopolist and n importing countries governments, and we investigate whether a tariff on resource imports can be advantageous for the consumers of the importing countries when the monopolist sets the price and the importing countries governments act in a non-cooperative way. We find that a tariff is advantageous for the consumers even when there is not commitment to the trade policy although the part of the rent that can be reaped by the importing countries decreases substantially with the number of importing countries. The optimality of the tariff in our dynamic game is explain…
Constrained consensus for bargaining in dynamic coalitional TU games
2011
We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. We assume that the players in the game interact only with their neighbors, where the neighbors may vary over time. The main contributions of the paper are the definition of a robust (coalitional) TU game and the development of a distributed bargaining protocol. We prove the convergence with probability 1 of the bargaining protocol to a random allocation that lies in the core of the robust game under some mild conditions on the players' communication graphs.
REPEATED GAMES WITH PROBABILISTIC HORIZON
2005
Repeated games with probabilistic horizon are defined as those games where players have a common probability structure over the length of the game's repetition, T. In particular, for each t, they assign a probability pt to the event that "the game ends in period t". In this framework we analyze Generalized Prisoners' Dilemma games in both finite stage and differentiable stage games. Our construction shows that it is possible to reach cooperative equilibria under some conditions on the distribution of the discrete random variable T even if the expected length of the game is finite. More precisely, we completely characterize the existence of sub-game perfect cooperative equilibria in finite s…
Advantage of Quantum Strategies in Random Symmetric XOR Games
2013
Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players.
Do individuals with higher cognitive ability play more strategically?
2016
Abstract This paper experimentally analyses the relationship between cognitive ability and strategic behaviour. In our experiment, individuals play in a sequential game, where computing the equilibrium is challenging. On completion of the game, we measure each player’s cognitive ability using Raven’s Progressive Matrices test. Our results reveal that the number of strategic decisions (played in the sequential game) increases significantly among those individuals with higher cognitive ability (measured by Raven’s test), compared to those with lower cognitive ability. These results clearly confirm that individuals with higher cognitive abilities play more strategically.
On Applying Adaptive Data Structures to Multi-Player Game Playing
2013
In the field of game playing, the focus has been on two-player games, such as Chess and Go, rather than on multi-player games, with dominant multi-player techniques largely being an extension of two-player techniques to an \(N\)-player environment. To address the problem of multiple opponents, we propose the merging of two previously unrelated fields, namely those of multi-player game playing and Adaptive Data Structures (ADS). We present here a novel move-ordering heuristic for a dominant multi-player game playing algorithm, namely the Best-Reply Search (BRS). Our enhancement uses an ADS to rank the opponents in terms of their respective threat levels to the player modeled by the AI algori…
Novel threat-based AI strategies that incorporate adaptive data structures for multi-player board games
2016
This paper considers the problem of designing novel techniques for multi-player game playing, in a range of board games and configurations. Compared to the well-known case of two-player game playing, multi-player game playing is a more complex problem with unique requirements. To address the unique challenges of this domain, we examine the potential of employing techniques inspired by Adaptive Data Structures (ADSs) to rank opponents based on their relative threats, and using this information to achieve gains in move ordering and tree pruning. We name our new technique the Threat-ADS heuristic. We examine the Threat-ADS’ performance within a range of game models, employing a number of diffe…